A stochastic two-target pursuit-evasion differential game with three players moving in a plane
نویسندگان
چکیده
منابع مشابه
Pursuit-Evasion Differential Game with Many Inertial Players
We consider pursuit-evasion differential game of countable number inertial players in Hilbert space with integral constraints on the control functions of players. Duration of the game is fixed. The payoff functional is the greatest lower bound of distances between the pursuers and evader when the game is terminated. The pursuers try to minimize the functional, and the evader tries to maximize i...
متن کاملStochastic multi-player pursuit–evasion differential games
Autonomous aerial vehicles play an important role in military applications such as in search, surveillance and reconnaissance. Multi-player stochastic pursuit–evasion (PE) differential game is a natural model for such operations involving intelligent moving targets with uncertainties. In this paper, some fundamental issues of stochastic PE games are addressed. We first model a general stochasti...
متن کاملFixed Duration Pursuit-Evasion Differential Game with Integral Constraints
We investigate a pursuit-evasion differential game of countably many pursuers and one evader. Integral constraints are imposed on control functions of the players. Duration of the game is fixed and the payoff of the game is infimum of the distances between the evader and pursuers when the game is completed. Purpose of the pursuers is to minimize the payoff and that of the evader is to maximize ...
متن کاملPursuit evasion: the herding noncooperative dynamic game - the stochastic model
This correspondence proposes a solution to the herding problem, a class of pursuit evasion problem, in stochastic framework. The problem involves a “pursuer” agent trying to herd a stochastically moving “evader” agent to a pen. The problem is stated in terms of allowable sequential actions of the two agents. The solution is obtained by applying the principles of stochastic dynamic programming. ...
متن کاملVisibility-Based Pursuit-Evasion in the Plane
The speed at which robots begin to enter various application domains is now largely dependent on the availability of robust and efficient algorithms that are capable of solving the complex planning problems inherent to the given domain. This talk will present a line of research that makes progress towards solving some of the complex planning problems found in target tracking applications where ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 1987
ISSN: 0898-1221
DOI: 10.1016/0898-1221(87)90099-x